package jjn.round1;

/**
 * @author Jiang Jining
 * @since 2023-05-31 23:37
 */
public class LeetCode79_WordSearch {
    public boolean exist(char[][] board, String word) {
        char[] charArray = word.toCharArray();
        int height = board.length;
        int width = board[0].length;
        boolean[][] visited = new boolean[height][width];
        return true;
    }

//    private void dfs(char[][] board, char[] array,)
}
